Nuprl Lemma : sys-valid_wf 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)).
Sys(valid)  AbsInterface(chain_sys(Cmd)) 
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), ES, EState(T), a:A fp B(a), f(a), Id, , strong-subtype(A;B), P  Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(Epred?info), kindcase(ka.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , b, constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,yt(x;y), Void, x:A.B(x), Top, S  T, suptype(ST), first(e), A, <ab>, pred(e), x.A(x), xt(x), P & Q, chain_config(), E, AbsInterface(A), chain_sys(Cmd), let x,y = A in B(x;y), e  X, {x:AB(x)} , E(X), t.1, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , valid-sys(es;Config;Sys;e), (e <loc e'), inr x , "$token", X(e), ccpred?(x), inl x , Atom, loc(e), e<e'P(e), ccpred-id(x), e<e'.P(e), ccsucc?(x), cctail?(x), P  Q, cchead?(x), ff, tt, False, True, A c B, valid-sys-dcdr{i:l}(es;Config;Cmd;Sys), (I|p), Dec(P), Sys(valid)
Lemmasvalid-sys-dcdr wf, es-interface-restrict wf, true wf, false wf, btrue wf, bfalse wf, cchead? wf, cctail? wf, ccsucc? wf, existse-before wf, ccpred-id wf, pi1 wf, alle-lt wf, es-locl wf, ccpred? wf, es-interface-val wf2, es-loc wf, es-interface wf, valid-sys wf, es-E-interface wf, es-is-interface wf, chain sys wf, es-E wf, chain config wf, deq wf, EOrderAxioms wf, kind wf, Msg wf, nat wf, val-axiom wf, cless wf, qle wf, bool wf, Knd wf, kindcase wf, IdLnk wf, constant function wf, loc wf, not wf, assert wf, first wf, top wf, unit wf, pred! wf, strongwellfounded wf, member wf, rationals wf, Id wf, EState wf, subtype rel wf, event system wf

origin